Numerical Experience with a Class of Trust-Region Algorithms for Unconstrained Smooth Optimization

نویسندگان

  • Abel Soares Siqueira
  • Geovani Nunes Grapiglia
چکیده

In this paper we investigate the numerical performance of trust-region algorithms in which the trust-region radius is updated by a nonlinear rule according with the quality of the models. This class of algorithms fits into the Nonlinear Stepsize Control framework recently proposed by Toint (Optimization Methods and Software 28: 82–95, 2013). The nonlinear control of the trust-region radius is characterized by a pair (α,β ) of user-defined parameters. Notable particular cases are the standard trust-region algorithm and the Fan-Yuan trust-region algorithm, which are obtained, respectively, with the traditional choices (α,β ) = (1,0) and (α,β ) = (1,1). As expected, our numerical results show that the numerical behaviour in this class of trust-region algorithms can vary greatly with different choices for (α,β ). In particular, we have identified pairs of parameters which are more efficient than the traditional ones.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A New Strategy for Choosing the Radius Adjusting Parameters in Trust Region Methods

Trust region methods are a class of important and efficient methods for solving unconstrained optimization problems. The efficiency of these methods strongly depends on the initial parameter, especially radius adjusting parameters. In this paper, we propose a new strategy for choosing the radius adjusting parameters. Numerical results from testing the new idea to solve a class of unconstrained ...

متن کامل

Solving the Unconstrained Optimization Problems Using the Combination of Nonmonotone Trust Region Algorithm and Filter Technique

In this paper, we propose a new nonmonotone adaptive trust region method for solving unconstrained optimization problems that is equipped with the filter technique. In the proposed method, the various nonmonotone technique is used. Using this technique, the algorithm can advantage from nonmonotone properties and it can increase the rate of solving the problems. Also, the filter that is used in...

متن کامل

A Trust-region Method using Extended Nonmonotone Technique for Unconstrained Optimization

In this paper, we present a nonmonotone trust-region algorithm for unconstrained optimization. We first introduce a variant of the nonmonotone strategy proposed by Ahookhosh and Amini cite{AhA 01} and incorporate it into the trust-region framework to construct a more efficient approach. Our new nonmonotone strategy combines the current function value with the maximum function values in some pri...

متن کامل

A limited memory adaptive trust-region approach for large-scale unconstrained optimization

This study concerns with a trust-region-based method for solving unconstrained optimization problems. The approach takes the advantages of the compact limited memory BFGS updating formula together with an appropriate adaptive radius strategy. In our approach, the adaptive technique leads us to decrease the number of subproblems solving, while utilizing the structure of limited memory quasi-Newt...

متن کامل

روش به روز رسانی متقارن از مرتبه اول برای حل مسایل بهینه سازی مقیاس بزرگ

The search for finding the local minimization in unconstrained optimization problems and a fixed point of the gradient system of ordinary differential equations are two close problems. Limited-memory algorithms are widely used to solve large-scale problems, while Rang Kuta's methods are also used to solve numerical differential equations. In this paper, using the concept of sub-space method and...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016